Recurrent Partial Words
نویسندگان
چکیده
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite partial word w, the number of distinct full words over the alphabet that are compatible with factors of w of length n, called subwords of w, refers to a measure of complexity of infinite partial words so-called subword complexity. This measure is of particular interest because we can construct partial words with subword complexities not achievable by full words. In this paper, we consider the notion of recurrence over infinite partial words, that is, we study whether all of the finite subwords of a given infinite partial word appear infinitely often, and we establish connections between subword complexity and recurrence in this more general framework.
منابع مشابه
Recurrent Partial Words and Representable Sets
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be total words (or simply words). Given an infinite partial word w, the number of distinct total words over the alphabet that are compatible with factors of w of a given length, called subwords of w, refers to...
متن کاملO-7: Y Chromosome Microdeletions Are Not Associated with Spontaneous Recurrent Pregnancy Loss in A Sinhalese Population in Sri Lanka
Background: Many advances have been made in reproductive medicine yet the spontaneous loss of a pregnancy remains the most common complication of pregnancy. The aetiology of spontaneous recurrent pregnancy loss (RPL) is multifactorial. Y chromosome microdeletions are found in approximately 7% of men with low sperm counts and, compared to the general population, a higher frequency of spontaneous...
متن کاملعقبماندگی ذهنی مرتبط با ناهنجاری کروموزومی در یک خانواده ایرانی: گزارش سه مورد
Background: Mental retardation is defined as impaired mental capacity and ability to comply with environmental and social conditions. Chromosomal abnormalities are the most important causes of mental retardation. Carriers of balanced chromosomal translocation are phenotypically normal, although they may be at risk of infertility, recurrent miscarriage or giving birth to mentally retarded childr...
متن کاملUsing Generating Functions to Solve Linear Inhomogeneous Recurrence Equations
This paper looks at the approach of using generating functions to solve linear inhomogeneous recurrence equations with constant coefficients. It will be shown that the generating functions for these recurrence equations are rational functions. By decomposing a generating function into partial fractions, one can derive explicit formula as well as asymptotic estimates for its coefficients. Key–Wo...
متن کاملThe Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape
Complexity in Convex Languages p. 1 Three Learnable Models for the Description of Language p. 16 Arbology: Trees and Pushdown Automata p. 32 Analysis of Communicating Automata p. 50 Regular Papers Complexity of the Satisfiability Problem for a Class of Propositional Schemata p. 58 A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton p. 70 A Fast Longest Common Subsequence A...
متن کامل